Some problems on idomatic partitions and b-colorings of direct products of complete graphs∗
نویسنده
چکیده
In this note, we deal with the characterization of the idomatic partitions and b-colorings of direct products of complete graphs. We recall some known results on idomatic partitions of direct products of complete graphs and we present new results concerning the b-colorings of the direct product of two complete graphs. Finally, some open problems are given.
منابع مشابه
Idomatic partitions of direct products of complete graphs
In this paper we give a full characterization of the idomatic partitions of the direct product of three complete graphs. We also show how to use such a characterization in order to construct idomatic partitions of the direct product of finitely many complete graphs.
متن کاملOn Idomatic Partitions of Direct Products of Complete Graphs
Independent dominating sets in the direct product of four complete graphs are considered. Possible types of such sets are classified. The sets in which every pair of vertices agree in exactly one coordinate, called T1-sets, are explicitly described. It is proved that the direct product of four complete graphs admits an idomatic partition into T1-sets if and only if each factor has at least thre...
متن کاملIndependent Dominating Sets and Idomatic Partitions in Direct Products of Four Complete Graphs
Independent dominating sets in the direct product of four complete graphs are considered. Possible types of such sets are classified. The sets in which every pair of vertices agree in exactly one coordinate, called T1-sets, are explicitly described. It is proved that the direct product of four complete graphs admits a partition into T1-sets if and only if each factor has at least three vertices...
متن کاملIndependent domination in directed graphs
In this paper we initialize the study of independent domination in directed graphs. We show that an independent dominating set of an orientation of a graph is also an independent dominating set of the underlying graph, but that the converse is not true in general. We then prove existence and uniqueness theorems for several classes of digraphs including orientations of complete graphs, paths, tr...
متن کاملList Partitions of Chordal Graphs
In an earlier paper we gave efficient algorithms for partitioning chordal graphs into k independent sets and l cliques. This is a natural generalization of the problem of recognizing split graphs, and is NPcomplete for graphs in general, unless k ≤ 2 and l ≤ 2. (Split graphs have k = l = 1.) In this paper we expand our focus and consider generalM -partitions, also known as trigraph homomorphism...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011